When Grammar and Parsing Agree
نویسنده
چکیده
Theoretical and experimental research on language has nowadays reached an extraordinary level of complexity. Generative linguistics has produced detailed maps of syntactic structures and computations that have significantly contributed to our knowledge of language architecture as an abstract system (Rizzi, 2012; Everaert et al., 2015). Psycho-/neurolinguistics has developed complex experimental designs and techniques that have made it possible to study linguistic processing with millisecond and voxel precision (Friederici, 2002, 2011; Hagoort, 2005; Bornkessel-Schlesewsky and Schlesewsky, 2009, 2013). Unfortunately, the dialogue between the two disciplines has not always been constant, with theoretical linguistics often proceeding without drawing on experimental results, and psycho-/neurolinguistics limitedly relying on linguistic theory (see discussion in Ferreira, 2005; Poeppel and Embick, 2005; Jackendoff, 2007; Embick and Poeppel, 2015). This has resulted in a sharp separation between the formal/computational level of linguistic analysis and the functional/neuro-anatomical investigation of language, limiting the depth with which we can investigate what we know and what we do with language. There have been proposals for the development of research programs in which linguistics and psycho-/neurolinguistics engage in a tighter dialog, with the aim of highlighting the relation between theoretical formalizations, cognitive mechanisms and their neurobiological implementation (Marr, 1982). The current opinion article shows how such a research program can be successfully implemented.
منابع مشابه
یک مدل بیزی برای استخراج باناظر گرامر زبان طبیعی
In this paper, we show that the problem of grammar induction could be modeled as a combination of several model selection problems. We use the infinite generalization of a Bayesian model of cognition to solve each model selection problem in our grammar induction model. This Bayesian model is capable of solving model selection problems, consistent with human cognition. We also show that using th...
متن کاملParsing Composed Grammars with Language Boxes
Parsing uncovers if, and how, an input stream conforms to a grammar. Language composition requires combining grammars together, yet all traditional parsing techniques have limitations when parsing composed grammars. We augment an incremental parser with language boxes, which allows us to retain the feel of traditional parsing whilst allowing arbitrary grammar composition.
متن کاملOn the Complexity of CCG Parsing
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will necessarily take exponential time when the size of the grammar, and not only the length of the input sentence, is included in the analysis. This result sets the formalism of Vijay-Shanker and We...
متن کاملAutomatic Grammar Partitioning for Syntactic Parsing
Natural language processing technologies offer ease-of-use of computers for average users, and ease-of-access to on-line information. Natural language, however, is complex, and the traditional methods of parsing with a single grammar and parser may result in an inefficient and large system that is difficult to maintain and is fragile in dealing with language irregularities. This paper begins by...
متن کاملRobust Parsing with a Large HPSG Grammar
In this paper we propose a partial parsing model which achieves robust parsing with a large HPSG grammar. Constraint-based precision grammars, like the HPSG grammar we are using for the experiments reported in this paper, typically lack robustness, especially when applied to real world texts. To maximally recover the linguistic knowledge from an unsuccessful parse, a proper selection model must...
متن کاملEfficient Combinatory Categorial Grammar Parsing
Efficient wide-coverage parsing is integral to large-scale NLP applications. Unfortunately, parsers for linguistically motivated formalisms, e.g. HPSG and TAG, are often too inefficient for these applications. This paper describes two modifications to the standard CKY chart parsing algorithm used in the Clark and Curran (2006) Combinatory Categorial Grammar (CCG) parser. The first modification ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018